973. K Closest Points to Origin - LeetCode Solution


Divide and Conquere Heap Sort

Python Code:

class Solution:
    
    from math import sqrt
    
    def kClosest(self, points: List[List[int]], K: int) -> List[List[int]]:
        
        w = []
        
        for i in range(len(points)):
            w.append([sqrt(points[i][0] **2 + points[i][1]**2) , points[i]])
        
        w.sort()
        
        q= []
        
        for i in range(K):
            q.append(w[i][1])
        
        return q
        


Comments

Submit
0 Comments
More Questions

1519A - Red and Blue Beans
466A - Cheap Travel
659E - New Reform
1385B - Restore the Permutation by Merger
706A - Beru-taxi
686A - Free Ice Cream
1358D - The Best Vacation
1620B - Triangles on a Rectangle
999C - Alphabetic Removals
1634C - OKEA
1368C - Even Picture
1505F - Math
1473A - Replacing Elements
959A - Mahmoud and Ehab and the even-odd game
78B - Easter Eggs
1455B - Jumps
1225C - p-binary
1525D - Armchairs
1257A - Two Rival Students
1415A - Prison Break
1271A - Suits
259B - Little Elephant and Magic Square
1389A - LCM Problem
778A - String Game
1382A - Common Subsequence
1512D - Corrupted Array
667B - Coat of Anticubism
284B - Cows and Poker Game
1666D - Deletive Editing
1433D - Districts Connection